Horn clauses - definizione. Che cos'è Horn clauses
Diclib.com
Dizionario ChatGPT
Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:

Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT

In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:

  • come viene usata la parola
  • frequenza di utilizzo
  • è usato più spesso nel discorso orale o scritto
  • opzioni di traduzione delle parole
  • esempi di utilizzo (varie frasi con traduzione)
  • etimologia

Cosa (chi) è Horn clauses - definizione

CLAUSE (A DISJUNCTION OF LITERALS) WITH AT MOST ONE POSITIVE, I.E. UNNEGATED, LITERAL
Horn logic; Definite clause; Horn sentence; Horn clauses; Dual-Horn clause; Horn formula; Universal Horn theory; Horn Logic

Horn clause         
<logic> A set of atomic literals with at most one {positive literal}. Usually written L < - L1, ..., Ln or < - L1, ..., Ln where n >= 0, " < - " means "is implied by" and comma stands for conjuction ("AND"). If L is false the clause is regarded as a goal. Horn clauses can express a subset of statements of first order logic. The name "Horn Clause" comes from the logician Alfred Horn, who first pointed out the significance of such clauses in 1951, in the article "On sentences which are true of direct unions of algebras", Journal of Symbolic Logic, 16, 14-21. A definite clause is a Horn clause that has exactly one positive literal. (2000-01-24)
Horn clause         
In mathematical logic and logic programming, a Horn clause is a logical formula of a particular rule-like form which gives it useful properties for use in logic programming, formal specification, and model theory. Horn clauses are named for the logician Alfred Horn, who first pointed out their significance in 1951.
definite clause         
<logic> A Horn clause that has exactly one {positive literal}. (2000-01-24)

Wikipedia

Horn clause

In mathematical logic and logic programming, a Horn clause is a logical formula of a particular rule-like form which gives it useful properties for use in logic programming, formal specification, and model theory. Horn clauses are named for the logician Alfred Horn, who first pointed out their significance in 1951.